Concept lattices with negative information: A characterization theorem
نویسندگان
چکیده
Classical Formal Concept Analysis (FCA) extracts, represents and manages knowledge from positive information, i.e., its fundamental data model is a binary relation between a set of objects and attributes indicating the presence of a property in an object. However, some applications require to treat the absence of some property in an object as a negative information to be explicitly represented and managed, too. Although mixed (positive and negative) information has been addressed in the past in FCA, such approaches maintain the standard framework, which hides the specific semantics and avoids the further use of direct techniques and methods for mixed information. In this work, the foundations of FCA are extended and, in particular, mixed concept lattices are studied in depth. The main result of this work is a characterization theorem specifying in lattice-theoretic terms which lattices are isomorphic to a mixed concept lattice.
منابع مشابه
Reduction and a Simple Proof of Characterization of Fuzzy Concept Lattices
Presented is a reduction of fuzzy Galois connections and fuzzy concept lattices to (crisp) Galois connections and concept lattices: each fuzzy concept lattice can be viewed as a concept lattice (in a natural way). As a result, a simple proof of the characterization theorem for fuzzy concept lattices is obtained. The reduction enables us to apply the results worked out for concept lattices to fu...
متن کاملSome results on $L$-complete lattices
The paper deals with special types of $L$-ordered sets, $L$-fuzzy complete lattices, and fuzzy directed complete posets.First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $L$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $L$-fuzzy complete lattice $(P;e)$, then the least fixpoint of $f$ is meet of a spe...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملA characterization of multiwavelet packets on general lattices
The objective of this paper is to establish a complete characterization of multiwavelet packets associated with matrix dilation on general lattices $Gamma$ in $mathbb R^d$ by virtue of time-frequency analysis, matrix theory and operator theory.
متن کاملFuzzy Concept Lattices Constrained by Hedges
We study concept lattices constrained by hedges. The principal aim is to control, in a parameterical way, the size of concept lattices, i.e. the number of conceptual clusters extracted from data. The paper presents theoretical insight, comments, and examples. We introduce new, parameterized, concept-forming operators and study their properties. We obtain an axiomatic characterization of the con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 369 شماره
صفحات -
تاریخ انتشار 2016